STRONG COMPLETENESS OF S4 FOR ANY DENSE-IN-ITSELF METRIC SPACE
نویسندگان
چکیده
منابع مشابه
Strong Completeness of S4 for any Dense-in-Itself Metric Space
In the topological semantics for modal logic, S4 is well-known to be complete for the rational line, for the real line, and for Cantor space: these are special cases of S4’s completeness for any dense-in-itself metric space. The construction used to prove completeness can be slightly amended to show that S4 is not only complete, but also strongly complete, for the rational line. But no similarl...
متن کاملStrong completeness of S4 wrt the real line
In the topological semantics for modal logic, S4 is well-known to be complete wrt the rational line and wrt the real line: these are special cases of S4’s completeness wrt any dense-in-itself metric space. The construction used to prove completeness can be slightly amended to show that S4 is not only complete, but strongly complete, wrt the rational line. But no similarly easy amendment is avai...
متن کاملFixed Point Theorems for kg- Contractive Mappings in a Complete Strong Fuzzy Metric Space
In this paper, we introduce a new class of contractive mappings in a fuzzy metric space and we present fixed point results for this class of maps.
متن کاملCompleteness in Probabilistic Metric Spaces
The idea of probabilistic metric space was introduced by Menger and he showed that probabilistic metric spaces are generalizations of metric spaces. Thus, in this paper, we prove some of the important features and theorems and conclusions that are found in metric spaces. At the beginning of this paper, the distance distribution functions are proposed. These functions are essential in defining p...
متن کاملClustering by density in any metric space
Given a distance matrix on X , establishing partitions (all the elements are clustered in disjoint classes) is generally made optimizing a criterion over the set of all the partitions with a number of classes that must be indicated. In this paper, we investigate a different approach. From the distance matrix, we first build a valued graph Γ = (X,E), for each vertex a density function De is eval...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Review of Symbolic Logic
سال: 2013
ISSN: 1755-0203,1755-0211
DOI: 10.1017/s1755020313000087